Regular matroid decomposition via signed graphs
نویسندگان
چکیده
The key to Seymour’s Regular Matroid Decomposition Theorem is his result that each 3-connected regular matroid with no R10or R12-minor is graphic or cographic. We present a proof of this in terms of signed graphs. 2004 Wiley Periodicals, Inc. J Graph Theory 48: 74–84, 2005
منابع مشابه
Decomposition of Binary Signed-Graphic Matroids
In this paper we employ Tutte’s theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the literature in the sense that it is not based on k-sums, but rather on the operation of deletion of a cocircuit. Specifically, it is shown that certain minor...
متن کاملDecompositions of signed-graphic matroids
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.
متن کاملRegular Matroids with Graphic Cocircuits
In this paper we examine the effect of removing cocircuits from regular matroids and we focus on the case in which such a removal always results in a graphic matroid. The first main result, given in section 3, is that a regular matroid with graphic cocircuits is signed-graphic if and only if it does not contain two specific minors. This provides a useful connection between graphic, regular and ...
متن کاملThe Regular Excluded Minors for Signed-Graphic Matroids
We show that the complete list of regular excluded minors for the class of signed-graphic matroids is M(G1), . . . ,M(G29), R15, R16. Here G1, . . . , G29 are the vertically 2-connected excluded minors for the class of projective-planar graphs.
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 48 شماره
صفحات -
تاریخ انتشار 2005